2 6 Ja n 20 12 Linear Kernels on Graphs Excluding Topological Minors ⋆
نویسندگان
چکیده
We show that problems that have finite integer index and satisfy a requirement we call treewidth-bounding admit linear kernels on the class of H-topological-minor free graphs, for an arbitrary fixed graph H . This builds on earlier results by Bodlaender et al. on graphs of bounded genus [2] and by Fomin et al. on H-minor-free graphs [9]. Our framework encompasses several problems, the prominent ones being Chordal Vertex Deletion, Feedback Vertex Set and Edge Dominating Set.
منابع مشابه
Linear Kernels on Graphs Excluding Topological Minors
We show that problems that have finite integer index and satisfy a requirement we call treewidth-bounding admit linear kernels on the class of H-topological-minor free graphs, for an arbitrary fixed graph H . This builds on earlier results by Bodlaender et al. on graphs of bounded genus [2] and by Fomin et al. on H-minor-free graphs [9]. Our framework encompasses several problems, the prominent...
متن کاملLinear kernels for (connected) dominating set on graphs with excluded topological subgraphs
We give the first linear kernels for Dominating Set and Connected Dominating Set problems on graphs excluding a fixed graph H as a topological minor. In other words, we give polynomial time algorithms that, for a given H-topological-minor free graph G and a positive integer k, output an H-topological-minor free graph G′ on O(k) vertices such that G has a (connected) dominating set of size k if ...
متن کاملExplicit Linear Kernels via Dynamic Programming
Several algorithmic meta-theorems on kernelization have appeared in the last years, starting with the result of Bodlaender et al. [FOCS 2009] on graphs of bounded genus, then generalized by Fomin et al. [SODA 2010] to graphs excluding a fixed minor, and by Kim et al. [ICALP 2013] to graphs excluding a fixed topological minor. Typically, these results guarantee the existence of linear or polynom...
متن کاملHitting forbidden minors: Approximation and Kernelization
We study a general class of problems called F -Deletion problems. In an F -Deletion problem, we are asked whether a subset of at most k vertices can be deleted from a graph G such that the resulting graph does not contain as a minor any graph from the family F of forbidden minors. We obtain a number of algorithmic results on the F -Deletion problem when F contains a planar graph. We give • a li...
متن کاملOn the existence of special depth first search trees
The Depth First Search (DFS) algorithm is one of the basic techniques which is used in a very large variety of graph algorithms. Most applications of the DFS involve the construction of a depth-first spanning tree (DFS tree). In this paper, we give a complete characterization of all the graphs in which every spanning tree is a DFS tree. These graphs are called Total −DFS −Graphs. We prove that ...
متن کامل